The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Proceedings of the Conference at Western Michigan University, May 10 – 13, 1972 Sponsored jointly by Western Michigan University and the U. S. Army Research Office-Durham, under Grant Number DA-ARO-D-31-124-72-G155
Although the results above seem to yield good estimators of an upper bound on connectivity, they can easily give rather poor estimates of k itself. One possible improvement could be effected by using the theorem of Harary and Chartrand [2] that δ≥p−2+n / 2 for some n such that 1≤n≤p−1 implies k≧n. This could give an estimate of a lower bound on k by using δ* in place of δ in the above inequality....
Virtually all of the known results on generalized Ramsey theory for graphs have been reported here, and the most general method of proof was brute force. There is certainly a need for more powerful and general methods, but it is not certain that these exist. Since the study of Ramsey properties of general graphs appears less intractable than that for complete graphs, this may well suggest fruitful...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.